Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
نویسندگان
چکیده
منابع مشابه
Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
For the directed edge preferential attachment network growth model studied by Bollobás et al. (2003) and Krapivsky and Redner (2001), we prove that the joint distribution of in-degree and out-degree has jointly regularly varying tails. Typically the marginal tails of the in-degree distribution and the out-degree distribution have different regular variation indices and so the joint regular vari...
متن کاملExpected degree of finite preferential attachment networks
Abstract We provide an analytic expression for the quantity described in the title. Namely, we perform a preferential attachment growth process to generate a scale-free network. At each stage we add a new node with m new links. Let k denote the degree of a node, and N the number of nodes in the network. The degree distribution is assumed to converge to a power-law (for k ≥ m) of the form k and ...
متن کاملHigh Degree Vertices and Eigenvalues in the Preferential Attachment Graph
The preferential attachment graph is a random graph formed by adding a new vertex at each time-step, with a single edge which points to a vertex selected at random with probability proportional to its degree. Every m steps the most recently added m vertices are contracted into a single vertex, so at time t there are roughly t/m vertices and exactly t edges. This process yields a graph which has...
متن کاملVertices of high degree in the preferential attachment tree ∗
We study the basic preferential attachment process, which generates a sequence of random trees, each obtained from the previous one by introducing a new vertex and joining it to one existing vertex, chosen with probability proportional to its degree. We investigate the number Dt(`) of vertices of each degree ` at each time t, focussing particularly on the case where ` is a growing function of t...
متن کاملDegree Distribution Nearby the Origin of a Preferential Attachment Graph
In their paper [1] Barabási and Albert proposed a certain random process of evolving graphs as a model of real-world networks, like the Internet. In their model vertices are added to the graph one by one, and edges connecting the new vertex to the old ones are drawn randomly, with probabilities proportional to the degree of the endpoint. In the particular case where only a single edge is allowe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2016
ISSN: 0021-9002,1475-6072
DOI: 10.1017/jpr.2015.15